Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2007, Vol. 30 ›› Issue (2): 32-37.doi: 10.13190/jbupt.200702.32.yuq

• Papers • Previous Articles     Next Articles

Shared Protection and Fast Protection for Dynamic Multicast Sessions in WDM Networks

YU Qing, GE Ning, DONG Zai-wang   

  1. (Department of Electronic Engineering, Tsinghua University, Beijing 100084, China)
  • Received:2006-03-22 Revised:1900-01-01 Online:2007-04-30 Published:2007-04-30
  • Contact: YU Qing

Abstract:

Two algorithms are proposed against single span failure in WDM networks. One is called link-based optimized shared-protection algorithm (LB-OSPM). The other is Hamiltonian preconfigured cycle (p-cycle) based protection algorithm (HPC). LB-OSPM introduces wavelength usage matrix and wavelength reservation matrix to record the detailed usage of wavelengths reserved in the past so as to allow different protection paths of working trees to share reserved wavelengths. HPC takes advantages of single Hamiltonian p-cycle to cover all working links in the network to attain source efficiency and fast protection. Study uses the topology of COST239 to calculate the network blocking probability of these two algorithms under various conditions of wavelength resources and network loads and compares them with an existing cost-effective algorithm, optimal path-pair-based shared disjoint paths algorithm(OPP-SDP). The results demonstrate that our algorithms can gain lower blocking probability while assuring a 100% restorability rate in the case of single span failure.

Key words: wavelength division multiplexing, multicast, shared protection, preconfigured cycle

CLC Number: